Balancing Degree, Diameter and Weight in Euclidean Spanners

نویسندگان

  • Shay Solomon
  • Michael Elkin
چکیده

In a seminal STOC’95 paper, Arya et al. [4] devised a construction that for any set S of n points in R and any ǫ > 0, provides a (1 + ǫ)-spanner with diameter O(log n), weight O(log n)w(MST (S)), and constant maximum degree. Another construction of [4] provides a (1 + ǫ)-spanner with O(n) edges and diameter α(n), where α stands for the inverse-Ackermann function. Das and Narasimhan [18] devised a construction with constant maximum degree and weight O(w(MST (S))), but whose diameter may be arbitrarily large. In another construction by Arya et al. [4] there is diameterO(log n) and weightO(log n)w(MST (S)), but it may have arbitrarily large maximum degree. These constructions fail to address situations in which we are prepared to compromise on one of the parameters, but cannot afford it to be arbitrarily large. In this paper we devise a novel unified construction that trades between maximum degree, diameter and weight gracefully. For a positive integer k, our construction provides a (1 + ǫ)-spanner with maximum degree O(k), diameter O(logk n + α(k)), weight O(k logk n log n)w(MST (S)), and O(n) edges. For k = O(1) this gives rise to maximum degree O(1), diameter O(log n) and weight O(log n)w(MST (S)), which is one of the aforementioned results of [4]. For k = n this gives rise to diameter O(α(n)), weight O(n(logn)α(n))w(MST (S)) and maximum degree O(n). In the corresponding result from [4] the spanner has the same number of edges and diameter, but its weight and degree may be arbitrarily large. Our construction also provides a similar tradeoff in the complementary range of parameters, i.e., when the weight should be smaller than log n, but the diameter is allowed to grow beyond log n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Doubling Spanners: Better and Simpler

In a seminal STOC’95 paper, Arya et al. conjectured that spanners for low-dimensional Euclidean spaces with constant maximum degree, hop-diameter O(logn) and lightness O(logn) (i.e., weight O(logn)· w(MST)) can be constructed in O(n logn) time. This conjecture, which became a central open question in this area, was resolved in the affirmative by Elkin and Solomon in STOC’13 (even for doubling m...

متن کامل

Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners

We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T ) = O(k · n) · w(MST (M)), and a spanning tree T ′ with weight w(T ′) = O(k) · w(MST (M)) and unweighted diameter O(k · n). These trees also achieve an optimal maximum degree. Furthermore, we demonstrate that these trees can be constructed efficiently...

متن کامل

On Spanners and Lightweight Spanners of Geometric Graphs

We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light weight. Such spanners have been extensively studied in the area of computational geometry and have been used as the building block for constructin...

متن کامل

Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners

We show that for every n-point metric space M there exists a spanning tree T with unweighted diameter O(log n) and weight ω(T ) = O(log n) · ω(MST (M)). Moreover, there is a designated point rt such that for every point v, distT (rt, v) ≤ (1 + ǫ) · distM (rt, v), for an arbitrarily small constant ǫ > 0. We extend this result, and provide a tradeoff between unweighted diameter and weight, and pr...

متن کامل

Randomized and deterministic algorithms for geometric spanners of small diameter

Let S be a set of n points in IR and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q of points there is a path from p to q of length at most t times the Euclidean distance between p and q. Such a path is called a t-spanner path. The spanner diameter of such a spanner is defined as the smallest integer D suc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010